CLIQUE: A FORTRAN IV program for the Needham-Moody-Hollis cluster-listing algorithm

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Comparison of Clique-Listing Algorithms

This paper compares several published algorithms which list all of the maximal cliques of a graph. A clique is a complete subgraph, i.e., a set of vertices and edges such that every pair of vertices is joined by an edge. A maximal clique is a clique which is not a proper subgraph of a larger clique. A closely related concept is that of a maximal independent set (MIS), where every pair of vertic...

Parametric Fortran - A Program Generator for Customized Generic Fortran Extensions

We describe the design and implementation of a program generator that can produce extensions of Fortran that are specialized to support the programming of particular applications. Extensions are specified through parameter structures that can be referred to in Fortran programs to specify the dependency of program parts on these parameters. By providing parameter values, a parameterized Fortran ...

FESW - - a finite-element Fortran IV program for solving the shallow-water equations

A Fortran IV computer program is documented, implementing a Galerkin finite-element method for solving the non-linear shallow-water equations on a limited domain. The resulting ordinary differential equations are integrated using a finite-difference discretization method in time. A time-extrapolated Crank-Nicolson numerical integration scheme is employed to quasi-linearize the non-linear advect...

A Tableau Algorithm for the Clique Guarded